<HTML><HEAD><TITLE>graph_get_edge(+Graph, +Source, +Target, -Edge)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_get_edge(+Graph, +Source, +Target, -Edge)</H1>
Finds a graph edge given source and target node
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>Source</EM></DT>
<DD>an integer node number
</DD>
<DT><EM>Target</EM></DT>
<DD>an integer node number
</DD>
<DT><EM>Edge</EM></DT>
<DD>an e/3 edge structure
</DD>
</DL>
<H2>Description</H2>
<P>
    This operation is linear in the number of edges adjacent to Source.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_get_edge(+, +, +, -) is semidet
</UL>
<H3>Fail Conditions</H3>
Fails if no matching edge exists
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_get_all_edges-2.html">graph_get_all_edges / 2</A>, <A HREF="../../lib/graph_algorithms/graph_get_adjacent_edges-3.html">graph_get_adjacent_edges / 3</A>, <A HREF="../../lib/graph_algorithms/graph_edge-2.html">graph_edge / 2</A>, <A HREF="../../lib/graph_algorithms/graph_adjacent_edge-3.html">graph_adjacent_edge / 3</A>, <A HREF="../../lib/graph_algorithms/graph_get_edges-4.html">graph_get_edges / 4</A>
</BODY></HTML>
